On Concept Lattices and Implication Bases from Reduced Contexts
نویسندگان
چکیده
Our paper introduces well-known methods for compressing formal context and focuses on concept lattices and attribute implication base changes of compressed formal contexts. In this paper Singular Value Decomposition and Non-negative Matrix Factorisation methods for compressing formal context are discussed. Computing concept lattices from reduced formal contexts results in a smaller number of concepts (with respect to the original lattice). Similarly, we present results of experiments in which we show a way to control smoothly the size of generated Guigues-Duquenne bases and provide some noise resistance for the basis construction process.
منابع مشابه
Euclidean Lattices: Algorithms and Cryptography
Euclidean lattices are a rich algebraic object that occurs in a wide variety of contextsin mathematics and in computer science. The present thesis considers several algorithmicaspects of lattices. The concept of lattice basis reduction is thoroughly investigated: in par-ticular, we cover the full range of time-quality trade-offs of reduction algorithms. On thefirst hand, we desc...
متن کاملTowards scalable divide-and-conquer methods for computing concepts and implications
Formal concept analysis (FCA) studies the partially ordered structure induced by the Galois connection of a binary relation between two sets (usually called objects and attributes), which is known as the concept lattice or the Galois lattice. Lattices and FCA constitute an appropriate framework for data mining, in particular for association rule mining, as many studies have practically shown. H...
متن کاملOn the Usability of Probably Approximately Correct Implication Bases
We revisit the notion of probably approximately correct implication bases from the literature and present a first formulation in the language of formal concept analysis, with the goal to investigate whether such bases represent a suitable substitute for exact implication bases in practical use-cases. To this end, we quantitatively examine the behavior of probably approximately correct implicati...
متن کاملNote on formal contexts of generalized one - sided concept lattices ∗
Generalized one-sided concept lattices represent one of the conceptual data mining methods, suitable for an analysis of object-attribute models with the different types of attributes. It allows to create FCA-based output in form of concept lattice with the same interpretation of concept hierarchy as in the case of classical FCA. The main aim of this paper is to investigate relationship between ...
متن کاملThe concept lattice functors
This paper is concerned with the relationship between contexts, closure spaces, and complete lattices. It is shown that, for a unital quantale L, both formal concept lattices and property oriented concept lattices are functorial from the category L-Ctx of L-contexts and infomorphisms to the category L-Sup of complete L-lattices and suprema-preserving maps. Moreover, the formal concept lattice f...
متن کامل